Hierarchical Plan Representations for Encoding Strategic Game AI
نویسندگان
چکیده
In this paper we explore the use of Hierarchical-Task-Network (HTN) representations to model strategic game AI. We will present two case studies. The first one reports on an experiment using HTNs to model strategies for Unreal Tournament® (UT) bots. We will argue that it is possible to encode strategies that coordinate teams of bots in first-person shooter games using HTNs. The second one compares an alternative to HTNs called Task-Method-Knowledge (TMK) process models. TMK models are of interest to game AI because, as we will show, they are as expressive as HTNs but have more convenient syntax. Therefore, HTN planners can be used to generate correct plans for coordinated team AI behavior modeled with TMK
منابع مشابه
Learning task hierarchies using statistical semantics and goal reasoning
This paper describes WORD2HTN, an algorithm for learning hierarchical tasks and goals from plan traces in planning domains. WORD2HTN combines semantic text analysis techniques and subgoal learning in order to generate Hierarchical Task Networks (HTNs). Unlike existing HTN learning algorithms, WORD2HTN learns distributed vector representations that represent the similarities and semantics of the...
متن کاملA Bayesian Model for Plan Recognition in RTS Games Applied to StarCraft
The task of keyhole (unobtrusive) plan recognition is central to adaptive game AI. “Tech trees” or “build trees” are the core of real-time strategy (RTS) game strategic (long term) planning. This paper presents a generic and simple Bayesian model for RTS build tree prediction from noisy observations, which parameters are learned from replays (game logs). This unsupervised machine learning appro...
متن کامل0368.4170: Cryptography and Game Theory Lecture Overview 1. What Is a Game?
A game is a model of interaction between 2 or more players (decision makers). The model includes the constraints on actions that players can take and the players’ interests, but does not specify the actions that the players do take. We start by defining strategic games in which each decision-maker chooses his plan of action once and for all (the game is played once), and these choices are made ...
متن کاملHierarchical Portfolio Search: Prismata's Robust AI Architecture for Games with Large Search Spaces
Online strategy video games offer several unique challenges to the field of AI research. Due to their large state and action spaces, existing search algorithms have difficulties in making strategically strong decisions. Additionally, the nature of competitive on-line video games adds the requirement that game designers be able to tweak game properties regularly when strategic imbalances are fou...
متن کاملStrategic Team AI Path Plans: Probabilistic Pathfinding
This paper proposes a novel method to generate strategic team AI pathfinding plans for computer games and simulations using probabilistic pathfinding. This method is inspired by genetic algorithms (Russell and Norvig, 2002), in that, a fitness function is used to test the quality of the path plans. The method generates high-quality path plans by eliminating the low-quality ones. The path plans ...
متن کامل